#include <bits/stdc++.h>
using namespace std;
int main(){
int t, a, b;
cin >> t;
while(t--){
cin >> a >> b;
if(a<=b&& __builtin_popcount(a)>=__builtin_popcount(b)){
bool y=1;
vector<int>va, vb;
for(int i=0; i<=30; i++)if(a&(1<<i))va.push_back(i);
for(int i=0; i<=30; i++)if(b&(1<<i))vb.push_back(i);
for(int i=0; i<vb.size(); i++)if(vb[i]<va[i])y=0;
if(y) cout << "YES\n";
else cout << "NO\n";
}
else cout << "NO\n";
}
}
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |
Removal of vertices | Happy segments |
Cyclic shifts | Zoos |
Build a graph | Almost correct bracket sequence |
Count of integers | Differences of the permutations |
Doctor's Secret | Back to School |